منابع مشابه
The Logarithmic Minkowski Problem
In analogy with the classical Minkowski problem, necessary and sufficient conditions are given to assure that a given measure on the unit sphere is the cone-volume measure of the unit ball of a finite dimensional Banach space.
متن کاملLogarithmic inapproximability of the radio broadcast problem
We show that the radio broadcast problem is Ω(log n)-inapproximable unless NP ⊆ BPTIME(nO(log logn)). This is the first result on the hardness of approximation of this problem. Our reduction is based on the reduction from the Label-Cover problem to the Set Cover problem due to Lund and Yannakakis [LY94], and uses some new ideas. Department of Computer Science, Yale University, New Haven, CT, US...
متن کاملLogarithmic Barrier Optimization Problem Using Neural Network
The combinatorial optimization problem is one of the important applications in neural network computation. The solutions of linearly constrained continuous optimization problems are difficult with an exact algorithm, but the algorithm for the solution of such problems is derived by using logarithm barrier function. In this paper we have made an attempt to solve the linear constrained optimizati...
متن کاملEffectivized Holder-logarithmic stability estimates for the Gel'fand inverse problem
We give effectivized Hölder-logarithmic energy and regularity dependent stability estimates for the Gel’fand inverse boundary value problem in dimension d = 3. This effectivization includes explicit dependance of the estimates on coefficient norms and related parameters. Our new estimates are given in L and L∞ norms for the coefficient difference and related stability efficiently increases with...
متن کاملLogarithmic density and logarithmic statistical convergence
In this paper we use the idea of logarithmic density to define the concept of logarithmic statistical convergence. We find the relations of logarithmic statistical convergence with statistical convergence, statistical summability (H, 1) introduced by Móricz (Analysis 24:127-145, 2004) and [H, 1]q-summability. We also give subsequence characterization of statistical summability (H, 1). MSC: 40A0...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Brazilian Mathematical Society, New Series
سال: 2011
ISSN: 1678-7544,1678-7714
DOI: 10.1007/s00574-011-0017-4